An Optimal Approach for the Tasks Allocation Based on the Fusion of Ec and Itcc in the Distributed Computing Systems

I. Introduction Distributed Computing systems have become popular due to the advances in computer hardware and interconnection network technology. Distributed processing system is a computer system in which multiple processors connected together through a high-bandwidth communication link. These links provides a medium for each processor to access data and programs on remote processors. The performance of any Distributed Processing System may suffer if the distribution of resource is not carefully implemented. In order to make the best use of the resources in a DCS, it becomes essential to maximize the overall throughput by allocating the tasks to processors in such a way that the allocated load on all the processors should be balanced. Partitioning of the application software into a number of small groups of modules among dissimilar processors is important parameter to determining the efficient utilization of available resources. It also enhances the computation speed. The task partitioning and task allocation activities influence the distributed software properties such as IPC [1, 2]. Many approaches have been reported for solving the task assignment problem in DCS.The problem of finding an optimal dynamic assignment of a modular program for a two-processor system is analyzed by [3]. One measure of usefulness of a general-purpose distributed computing system is the system's ability to provide a level of performance commensurate to the degree of multiplicity of resources present in the system. Taxonomy of approaches to the resource management problem is reported [4]. The taxonomy, while presented and discussed in terms of distributed scheduling, is also applicable to most types of resource management. A model for allocating information files have been reported by [5] the model considers storage cost, transmission cost, file lengths, and request rates, as well as updating rates of files, the maximum allowable expected access times to files at each computer, and the storage capacity of each computer. The model is formulated into a nonlinear integer zero-one programming problem, which may be reduced to a linear zero-one programming problem. Known solutions of a large number of important (and difficult) computational problems called NP-complete problems depend on enumeration techniques which examine all feasible alternatives. The design of enumeration schemes in a distributed environment have been reported by [6]. A task allocation model that allocates application tasks among processors in distributed computing systems satisfying: 1) minimum inter-processor communication cost, 2) balanced utilization of each processor, and 3) all engineering application requirements has been reported …